package DataStructure.list;
//循环链表 todo
public class CLinkList<E> implements MyList<E>{
    private Node head;//头节点
    private int size;

    //链表节点
    private class Node{
        private E e;
        private Node next;
        public Node(E e, Node next){
            this.e=e;
            this.next=next;
        }
    }
    @Override
    public int size() {
        return 0;
    }

    @Override
    public boolean isEmpty() {
        return false;
    }

    @Override
    public boolean contains(E element) {
        return false;
    }

    @Override
    public boolean add(E element) {
        return false;
    }

    @Override
    public void add(int index, E element) {

    }

    @Override
    public boolean remove(E element) {
        return false;
    }

    @Override
    public E remove(int index) {
        return null;
    }

    @Override
    public E get(int index) {
        return null;
    }

    @Override
    public int indexOf(E element) {
        return 0;
    }

    @Override
    public E set(int index, E element) {
        return null;
    }

    @Override
    public void clear() {

    }
}
